Optimal Multi - Writer Multi - Reader Atomic RegisterAmos
نویسندگان
چکیده
This paper addresses the wide gap in space complexity of atomic, multi-writer, multi-reader register implementations. While the space complexity of all previous implementations is linear, the lower bounds are logarithmic. We present two implementations which close this gap: The rst implementation uses multi-reader physical registers while the second uses single-reader physical registers. Both implementations are optimal with respect to the two most important complexity criteria: Their space complexity is logarithmic and their time complexity is linear.
منابع مشابه
Efficient Atomic Snapshots U sing Lattice Agreement ( Preliminary
The snapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to the lattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an implementation of a snapshot object. The overhead cost of this transformation is only a linear number of operations on atomic single-writer mul...
متن کاملGraceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the message-passing setting. A robust emulation of atomic single-writer/multi-reader registers in message-passing systems was developed by Attiya, Bar-Noy and Dolev (1995). This emulation was extended by Lynch and Shvarts...
متن کاملTwo Consensus Algorithms with Atomic Registers and Failure Detector Omega
We present here two consensus algorithms in shared memory asynchronous systems with the eventual leader election failure detector Ω. In both algorithms eventually only the leader given by failure detector Ω will progress, and being eventually alone to make steps the leader will decide. The first algorithm uses an infinite number of multi-writer multi-reader atomic registers and works with an un...
متن کاملStorage-Efficient Shared Memory Emulation
Improvements in communication fabrics have enabled access to ever larger pools of data with decreasing access latencies, bringing large-scale memory fabrics closer to feasibility. However, with an increase in scale come new challenges. Since more systems are aggregated, maintaining a certain level of reliability requires increasing the storage redundancy, typically via data replication. The cor...
متن کاملA New Characterization of Atomic Registers shared-memory
We study the fundamental communication properties of two major shared-memory models, namely the ones in which processes communicate via Single-Writer/Multi-Reader (SWMR for short) atomic registers and Atomic-Snapshot object, respectively. In 1998, Gafni already adressed this question. We prove in this paper that the characterization he gave does not match the well-known equivalence between thes...
متن کامل